METRIC SEMANTICS FOR REACTIVE PROBABILISTIC PROCESSES by GETHIN

نویسندگان

  • JOSIAH NORMAN
  • Peter Hancox
  • Achim Jung
  • Gavin Lowe
چکیده

In this thesis we present three mathematical frameworks for the modelling of reactive probabilistic communicating processes. We first introduce generalised labelled transition systems as a model of such processes and introduce an equivalence, coarser than probabilistic bisimulation, over these systems. Two processes are identified with respect to this equivalence if, for all experiments, the probabilities of the respective processes passing a given experiment are equal. We next consider a probabilistic process calculus including external choice, internal choice, action-guarded probabilistic choice, synchronous parallel and recursion. We give operational semantics for this calculus be means of our generalised labelled transition systems and show that our equivalence is a congruence for this language. Following the methodology introduced by de Bakker & Zucker, we then give denotational semantics to the calculus by means of a complete metric space of probabilistic processes. The derived metric, although not an ultra-metric, satisfies the intuitive property that the distance between two processes tends to 0 if a measure of the differences of their observable behaviour also tends to 0. We show that the denotational model is fully abstract with respect to our equivalence. We also provide a logical characterisation of the process equivalence by means of a variant of the quantitative Hennessy-Milner Logic (HML), where each HML formula is interpreted as the probability of it being satisfied by the process instead of the usual truth value. Two processes are then shown equivalent if, and only if, they agree on the quantities assigned to all HML formulae.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Fully Abstract Metric-Space Denotational Semantics for Reactive Probabilistic Processes

We consider the calculus of Communicating Sequential Processes (CSP) [8] extended with action-guarded probabilistic choice and provide it with an operational semantics in terms of a suitable extension of Larsen and Skou’s [14] reactive probabilistic transition systems. We show that a testing equivalence which identifies two processes if they pass all tests with the same probability is a congrue...

متن کامل

Probabilistic Metric Semantics for a Simple Language with Recursion

We consider a simple divergence-free language RP for reactive processes which includes prefixing, deterministic choice, actionguarded probabilistic choice, synchronous parallel and recursion. We show that the probabilistic bisimulation of Larsen & Skou is a congruence for this language. Following the methodology introduced by de Bakker & Zucker we give denotational semantics to this language by...

متن کامل

Jensen-Shannon Divergency as a Measure of Information Flow in Reactive Processes Technical Report: TR-09-07

This paper outlines an approach for measuring information flow in reactive process descriptions with input, output, and probabilistic non-deterministic behaviours. The basic concept in our work is that the quantity of information flow is calculated by looking at the different behaviours of a high user from a low user’s observations. First, we present the probabilistic model of reactive labelled...

متن کامل

A Testing Equivalence for Reactive Probabilistic Processes

We consider a generalisation of Larsen and Skou’s [19] reactive probabilistic transition systems which exhibit three kinds of choice: action-guarded probabilistic choice, external (deterministic) and internal (non-deterministic) choice. We propose an operational preorder and equivalence for processes based on testing. Milner’s button pushing experiments scenario is extended with random experime...

متن کامل

Probabilistic Model Checking of Labelled Markov Processes via Finite Approximate Bisimulations

This paper concerns labelled Markov processes (LMPs), probabilistic models over uncountable state spaces originally introduced by Prakash Panangaden and colleagues. Motivated by the practical application of the LMP framework, we study its formal semantics and the relationship to similar models formulated in control theory. We consider notions of (exact and approximate) probabilistic bisimulatio...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997